59 research outputs found
Detectability of distributed consensus-based observer networks: An elementary analysis and extensions
This paper continues the study of local detectability and observability
requirements on components of distributed observers networks to ensure
detectability properties of the network. First, we present a sketch of an
elementary proof of the known result equating the multiplicity of the zero
eigenvalue of the Laplace matrix of a digraph to the number of its maximal
reachable subgraphs. Unlike the existing algebraic proof, we use a direct
analysis of the graph topology. This result is then used in the second part of
the paper to extend our previous results which connect the detectability of an
observer network with corresponding local detectability and observability
properties of its node observers. The proposed extension allows for
nonidentical matrices to be used in the interconnections.Comment: Accepted for presentation at the 2014 Australian Control Conference,
Canberra Australia, Nov 201
Control over adversarial packet-dropping communication networks revisited
We revisit a one-step control problem over an adversarial packet-dropping
link. The link is modeled as a set of binary channels controlled by a strategic
jammer whose intention is to wage a `denial of service' attack on the plant by
choosing a most damaging channel-switching strategy. The paper introduces a
class of zero-sum games between the jammer and controller as a scenario for
such attack, and derives necessary and sufficient conditions for these games to
have a nontrivial saddle-point equilibrium. At this equilibrium, the jammer's
optimal policy is to randomize in a region of the plant's state space, thus
requiring the controller to undertake a nontrivial response which is different
from what one would expect in a standard stochastic control problem over a
packet dropping channel.Comment: This paper has been accepted for presentation at the 2014 American
Control Conference, Portland, Orego
- …